A weight-balanced branching rule for SAT

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Faster Randomized Branching Algorithms for $r$-SAT

The problem of determining if an r-CNF boolean formula F over n variables is satisifiable reduces to the problem of determining if F has a satisfying assignment with a Hamming distance of at most d from a fixed assignment α [DGH02]. This problem is also a very important subproblem in Schöning’s local search algorithm for r-SAT [Sch99]. While Schöning described a randomized algorithm solves this...

متن کامل

Branching Process approach for 2-SAT thresholds

It is well known that, as n tends to infinity, the probability of satisfiability for a random 2-SAT formula on n variables, where each clause occurs independently with probability α/2n, exhibits a sharp threshold at α = 1. We provide a simple conceptual proof of this fact based on branching process arguments. We also study a generalized 2-SAT model in which each clause occurs independently but ...

متن کامل

A Rule Format for Rooted Branching Bisimulation

SOS rule formats are sets of syntactical constraints over SOS transition rules ensuring semantical properties of the derived LTS. Given a rule format, our proposal is to try to relax the constraints imposed by the format on each single transition rule at the price of introducing some reasonable constraint on the form of the whole set of rules, obtaining a new format ensuring the same semantical...

متن کامل

Balanced K-SAT and Biased random K-SAT on trees

Abstract We study and solve some variations of the random K-satisfiability problem balanced K-SAT and biased random K-SAT on a regular tree, using techniques we have developed earlier [14]. In both these problems, as well as variations of these that we have looked at, we find that the SATUNSAT transition obtained on the Bethe lattice matches the exact threshold for the same model on a random gr...

متن کامل

Balanced branching in transcription termination.

The theory of stochastic transcription termination based on free-energy competition [von Hippel, P. H. & Yager, T. D. (1992) Science 255, 809-812 and von Hippel, P. H. & Yager, T. D. (1991) Proc. Natl. Acad. Sci. USA 88, 2307-2311] requires two or more reaction rates to be delicately balanced over a wide range of physical conditions. A large body of work on glasses and large molecules suggests ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical and Computer Modelling

سال: 2003

ISSN: 0895-7177

DOI: 10.1016/s0895-7177(03)90030-6